Pruning processes and a new characterization of convex geometries
نویسندگان
چکیده
We provide a new characterization of convex geometries via a multivariate version of an identity that was originally proved, in a special case arising from the k-SAT problem, by Maneva, Mossel and Wainwright. We thus highlight the connection between various characterizations of convex geometries and a family of removal processes studied in the literature on random structures.
منابع مشابه
Shelling Processes and a New Characterization of Convex Geometries
We provide a new characterization of convex geometries via a multi-variate version of an identity that was originally proved by Maneva, Mossel and Wainwright for particular combinatorial objects defined in the context of the k-SAT problem. We thus highlight the connection between various characterizations of convex geometries and a family of removal processes studied in the literature on random...
متن کاملCharacterization of Properly Efficient Solutions for Convex Multiobjective Programming with Nondifferentiable vanishing constraints
This paper studies the convex multiobjective optimization problem with vanishing constraints. We introduce a new constraint qualification for these problems, and then a necessary optimality condition for properly efficient solutions is presented. Finally by imposing some assumptions, we show that our necessary condition is also sufficient for proper efficiency. Our results are formula...
متن کاملA New Method for Characterization of Biological Particles in Microscopic Videos: Hypothesis Testing Based on a Combination of Stochastic Modeling and Graph Theory
Introduction Studying motility of biological objects is an important parameter in many biomedical processes. Therefore, automated analyzing methods via microscopic videos are becoming an important step in recent researches. Materials and Methods In the proposed method of this article, a hypothesis testing function is defined to separate biological particles from artifact and noise in captured v...
متن کاملOn new faster fixed point iterative schemes for contraction operators and comparison of their rate of convergence in convex metric spaces
In this paper we present new iterative algorithms in convex metric spaces. We show that these iterative schemes are convergent to the fixed point of a single-valued contraction operator. Then we make the comparison of their rate of convergence. Additionally, numerical examples for these iteration processes are given.
متن کاملSynthesis, Characterization, and Theoretical Studies of the New Antibacterial Zn(II) Complexes from New Fluorescent Schiff Bases Prepared by imidazo[4',5':3,4]benzo[1,2-c]isoxazole
The novel fluorescentheterocyclic bidentate ligands have been synthesized by the high yields reaction of 8-(4-chlorophenyl)-3-Iso-butyl-3H-imidazo[4',5':3,4]benzo[1,2-c]isoxazol-5-amine with p-hydroxybenzaldehyde and p-chlorobenzaldehyde. The ligands reacted with Zn(II) ion to gained novel complexes. The optical properties of these structures were checked and the outcomes represented that t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009